منابع مشابه
Pretopologies and Completeness Proofs
Pretopologies were introduced in [S] and there shown to give a complete semantics for a propositional sequent calculus BL here called basic linear logic, as well as for its extensions by structural rules, ex falso quodlibet or double negation. Immediately after the Logic Colloquium ’88, conversation with Per Martin-Löf helped me to see how the pretopology semantics should be extended to predica...
متن کاملThe discovery of my completeness proofs
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive...
متن کاملCompleteness of the Random Graph: Two Proofs
We take a countably infinite random graph, state its axioms as a theory in first-order logic, and prove its completeness in two distinct ways. For the first proof, we show that the random graph is א0-categorical, meaning that it has only one countably infinite model up to isomorphism. Completeness follows. For the second proof, we show that the theory of the random graph admits quantifier elimi...
متن کاملRecombination Spaces, Metrics, and Pretopologies
The topological features of genotype spaces given a genetic operator have a substantial impact on the course of evolution. We explore the structure of the recombination spaces arising from four different unequal crossover models in the context of pretopological spaces. We show that all four models are incompatible with metric distance measures due to a lack of symmetry.
متن کاملHoare logic and VDM : machine-checked soundness and completeness proofs
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Many incorrect results have been published in the past. We take advantage of the computer-aided proof tool LEGO to interactively establish soundness and completeness of both Hoare Logic and the operation decomposition rules of the Vienna Development Method (VDM) with resp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 1995
ISSN: 0022-4812,1943-5886
DOI: 10.2307/2275761